package com.leetcode.offer.chapter5;

import com.leetcode.basic.ListNode;

/**
 * @author Dennis Li
 * @date 2020/7/15 16:19
 */
public class InstersectionNode_52 {

    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        ListNode cur1 = headA, cur2 = headB;
        while (cur1 != cur2){
            cur1 = cur1 == null ? headB : cur1.next;
            cur2 = cur2 == null ? headA : cur2.next;
        }
        return cur1;
    }

}
